Volume growth, spectrum and stochastic completeness of infinite graphs
نویسندگان
چکیده
منابع مشابه
Dirichlet Forms and Stochastic Completeness of Graphs and Subgraphs
We characterize stochastic completeness for regular Dirichlet forms on discrete sets. We then study how stochastic completeness of a subgraph is related to stochastic completeness of the whole graph. We show that any graph is a subgraph of a stochastically complete graph and that stochastic incompleteness of a suitably modified subgraph implies stochastic incompleteness of the whole graph. Alon...
متن کاملStochastic Quantization of Field Theory in Finite and Infinite Volume
Using the theory of Dirichlet forms a distribution-valued symmetric Markov process is constructed so that it has the (qY')2 measure as its invariant probability measure. Several properties of this process are proved and a finite to infinite volume limit theorem is established.
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولD-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملThe Growth of Infinite Graphs: Boundedness and Finite Spreading
An infinite graph is called bounded if for every labelling of its vertices with natural numbers there exists a sequence of natural numbers which eventually exceeds the labelling along any ray in the graph. Thomassen has conjectured that a countable graph is bounded if and only if its edges can be oriented, possibly both ways, so that every vertex has finite out-degree and every ray has a forwar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Zeitschrift
سال: 2012
ISSN: 0025-5874,1432-1823
DOI: 10.1007/s00209-012-1101-1